package a10_动态规划;

/**
 * <p>
 * a43_最长重复子数组复习3
 * </p>
 *
 * @author flyduck
 * @since 2025/3/14
 */
public class a43_最长重复子数组复习3 {
    //dp[i][j]：将
    // nums1[i-1]作为公共的数组的结尾
    // nums2[j-1]作为公共的数组的结尾

    //递推公式：
    //dp[i-1] == dp[j-1]
    //dp[i][j] = dp[i-1][j-1] + 1

    public int findLength(int[] nums1, int[] nums2) {
        int result = 0;

        int[][] dp = new int[nums1.length+1][nums2.length+1];

        for (int i = 1; i <= nums1.length; i++) {
            for (int j = 1; j <= nums2.length; j++) {
                if(nums1[i-1] == nums2[j-1]){
                    dp[i][j] = dp[i-1][j-1] + 1;
                }
                result = Math.max(result, dp[i][j]);
            }
        }

        return result;
    }
}
